package threadedBinaryTree;

public class ThreadedBinaryTreeDemo {
    public static void main(String[] args) {
        HeroNode root = new HeroNode(1,"A");
        HeroNode node2 = new HeroNode(3,"B");
        HeroNode node3 = new HeroNode(6,"C");
        HeroNode node4 = new HeroNode(8,"D");
        HeroNode node5 = new HeroNode(10,"E");
        HeroNode node6 = new HeroNode(14,"F");

        root.setLeft(node2);
        root.setRight(node3);
        node2.setLeft(node4);
        node2.setRight(node5);
        node3.setLeft(node6);

        //测试线索化
        ThreadedBinaryTree threadedBinaryTree = new ThreadedBinaryTree();
        threadedBinaryTree.setRoot(root);
        threadedBinaryTree.threadedNodes();

        HeroNode leftNode = node5.getLeft();
        HeroNode rightNode = node5.getRight();
        System.out.println("10的前驱节点:" + leftNode);
        System.out.println("10的后继节点:" + rightNode);

        System.out.println("线索化遍历：");
        threadedBinaryTree.threadedList();

    }
}

//线索化二叉树类
class ThreadedBinaryTree{
    private HeroNode root;

    private HeroNode pre = null;

    //注意这里需要setRoot
    public void setRoot(HeroNode root) {
        this.root = root;
    }

    /**
     * 线索化二叉树
     * @param node:节点
     */
    public void threadedNodes(HeroNode node){
        if(node == null){
            return;
        }

        //先线索化左子树
        threadedNodes(node.getLeft());

        //再线索化当前节点
        if(node.getLeft() == null){
            node.setLeft(pre);
            node.setLeftType(1);
        }

        if(pre != null && node.getRight() == null){
            pre.setRight(node);
            pre.setRightType(1);
        }

        pre = node;

        //最后线索化右子树
        threadedNodes(node.getRight());
    }

    //遍历线索化二叉树
    public void threadedList(){
        HeroNode node = root;

        while(node != null){
            while(node.getLeftType() == 0){
                node = node.getLeft();
            }

            System.out.println(node);

            while(node.getRightType() == 1){
                node = node.getRight();
                System.out.println(node);
            }

            //替换当前遍历节点
            node = node.getRight();
        }
    }

    //threadedNodes方法重载
    public void threadedNodes(){
        this.threadedNodes(root);
    }

    //前序遍历
    public void preOrder(){
        if(this.root != null){
            this.root.preOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //中序遍历
    public void infixOrder(){
        if(this.root != null){
            this.root.infixOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //后序遍历
    public void postOrder(){
        if(this.root != null){
            this.root.postOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //前序遍历查找
    public HeroNode preOrderSearch(int no){
        if(this.root != null){
            return root.preOrderSearch(no);
        }else{
            return null;
        }
    }

    //中序遍历查找
    public HeroNode infixOrderSearch(int no){
        if(this.root != null){
            return root.infixOrderSearch(no);
        }else{
            return null;
        }
    }

    //后序遍历查找
    public HeroNode postOrderSearch(int no){
        if(this.root != null){
            return root.postOrderSearch(no);
        }else{
            return null;
        }
    }

    //删除节点
    public void delNode(int no){
        if(root != null){
            if(root.getNo() == no){
                this.root = null;
            }else{
                root.delNode(no);
            }
        }else{
            System.out.println("没有找到该节点");
        }
    }

}

class HeroNode{
    private int no;
    private String name;
    private HeroNode left;
    private HeroNode right;

    //leftType == 0 表示指向左子树，leftType == 1 表示指向前驱结点
    //rightType == 0 表示指向右子树，rightType == 1 表示指向后继结点
    private int leftType;
    private int rightType;

    public int getLeftType() {
        return leftType;
    }

    public int getRightType() {
        return rightType;
    }

    public void setLeftType(int leftType) {
        this.leftType = leftType;
    }

    public void setRightType(int rightType) {
        this.rightType = rightType;
    }

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public HeroNode getLeft() {
        return left;
    }

    public void setLeft(HeroNode left) {
        this.left = left;
    }

    public HeroNode getRight() {
        return right;
    }

    public void setRight(HeroNode right) {
        this.right = right;
    }

    //前序二叉树
    public void preOrder(){
        System.out.println(this);
        if(this.left != null){
            this.left.preOrder();
        }

        if(this.right != null){
            this.right.preOrder();
        }
    }

    //中序二叉树
    public void infixOrder(){
        if(this.left != null){
            this.left.infixOrder();
        }

        System.out.println(this);

        if(this.right != null){
            this.right.infixOrder();
        }
    }

    //后序二叉树
    public void postOrder(){
        if(this.left != null){
            this.left.postOrder();
        }

        if(this.right != null){
            this.right.postOrder();
        }

        System.out.println(this);
    }

    //前序遍历查找
    public HeroNode preOrderSearch(int no){
        if(this.no == no){
            return this;
        }

        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.preOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.right != null){
            resNode = this.right.preOrderSearch(no);
        }
        return resNode;
    }

    //中序遍历查找
    public HeroNode infixOrderSearch(int no){
        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.infixOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.no == no){
            return this;
        }

        if(this.right != null){
            resNode = this.right.infixOrderSearch(no);
        }

        return resNode;
    }

    //后序遍历查找
    public HeroNode postOrderSearch(int no){
        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.postOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.right != null){
            resNode = this.right.postOrderSearch(no);
        }

        if(this.no == no){
            return this;
        }
        return resNode;
    }

    //删除节点
    public void delNode(int no){
        if(this.left != null && this.left.no == no){
            this.left = null;
            return;
        }

        if(this.right != null && this.right.no == no){
            this.right = null;
            return;
        }

        if(this.left != null){
            this.left.delNode(no);
        }

        if(this.right != null){
            this.right.delNode(no);
        }
    }
}
